Multigrid methods for saddle point systems using constrained smoothers
نویسندگان
چکیده
منابع مشابه
Multigrid relaxation methods for systems of saddle point type ✩
In this paper, we give an overview of multigrid methods for two systems of equations, namely the Stokes equations and the incompressible poroelasticity equations. We emphasize the saddle point type aspect in these two systems and discuss their discretization on staggered and collocated grids. The basic problem is that of smoothing a system of equations that has a zero (or almost zero) block in ...
متن کاملMultigrid methods for saddle point problems: Stokes and Lamé systems
We develop new multigrid methods for a class of saddle point problems that include the Stokes system in fluid flow and the Lamé system in linear elasticity as special cases. The new smoothers in the multigrid methods involve optimal preconditioners for the discrete Laplace operator. We prove uniform convergence of the W -cycle algorithm in the energy norm and present numerical results for W -cy...
متن کاملMultigrid Methods for Saddle Point Problems: Darcy Systems
We design and analyze multigrid methods for the saddle point problems resulting from Raviart-Thomas-Nédélec mixed finite element methods (of order at least 1) for the Darcy system in porous media flow. Uniform convergence of the W -cycle algorithm in a nonstandard energy norm is established. Extensions to general second order elliptic problems are also addressed.
متن کاملAlgebraic multigrid (AMG) for saddle point systems from meshfree discretizations
Meshfree discretizations construct approximate solutions to partial differential equation based on particles, not on meshes, so that it is well suited to solve the problems on irregular domains. Since the nodal basis property is not satisfied in meshfree discretizations, it is difficult to handle essential boundary conditions. In this paper, we employ the Lagrange multiplier approach to solve t...
متن کاملProjected Krylov Methods for Saddle-Point Systems
Projected Krylov methods are full-space formulations of Krylov methods that take place in a nullspace. Provided projections into the nullspace can be computed accurately, those methods only require products between an operator and vectors lying in the nullspace. We provide systematic principles for obtaining the projected form of any well-defined Krylov method. Projected Krylov methods are math...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2015
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2015.09.020